Irreducible elements and uniquely generated algebras
نویسندگان
چکیده
منابع مشابه
Irreducible elements and uniquely generated algebras
An algebra A is uniquely generated by a set G if G is a subset of every set that generates A. We investigate uniquely generated algebras and focus especially on equational classes of algebras in which the free algebras are uniquely generated. We show that such classes possess a number of algebraic properties that are in some sense extremal. We also present algebraic conditions on an equational ...
متن کاملC∗-algebras generated by unbounded elements
The main aim of this paper is to provide a proper mathematical framework for the theory of topological non-compact quantum groups, where we have to deal with non-unital C∗-algebras. The basic concepts and results related to the affiliation relation in the C∗-algebra theory are recalled. In particular natural topologies on the set of affiliated elements and on the set of morphisms are considered...
متن کاملLie Algebras Generated by Extremal Elements
We study Lie algebras generated by extremal elements (i.e., elements spanning inner ideals of L) over a field of characteristic distinct from 2. We prove that any Lie algebra generated by a finite number of extremal elements is finite dimensional. The minimal number of extremal generators for the Lie algebras of type An (n 1), Bn (n 3), Cn (n 2), Dn (n 4), En (n = 6,7,8), F4 and G2 are shown to...
متن کاملNonrepresentable Relation Algebras Generated by Functional Elements
There are nonrepresentable relation algebras generated by their functional elements. This solves a problem posed many years ago. The number of generating functional elements can be as low as 2. This leaves open the problem whether there is a nonrepresentable relation algebra generated by a single functional element.
متن کاملUniquely undefinable elements ∗ Greg
There exists a model in a countable language having a unique element which is not definable in Lω1,ω. We answer problem 10.12 from the updated version of Arnie Miller’s problem list, [3]. Definition For a structure M and a ∈ M, we say that a is definable over Lω1,ω if there is a formul ψ ∈ Lω1,ω such that for all b ∈ M a = b ⇔ M |= ψ(b). Theorem 0.1 There is a countable language L and a model M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00364-8